Technical Note—The Stochastic Discrete Dynamic Lot Size Problem: An Open-Loop Solution
نویسندگان
چکیده
منابع مشابه
Heuristic-based neural networks for stochastic dynamic lot sizing problem
Multi-period single-item lot sizing problem under stochastic environment has been tackled by few researchers and remains in need of further studies. It is mathematically intractable due to its complex structure. In this paper, an optimum lot-sizing policy based on minimum total relevant cost under price and demand uncertainties was studied by using various artificial neural networks trained wit...
متن کاملThe Linear Dynamic Lot Size Problem with Minimum Order Quantities
This paper continues the analysis of a special uncapacitated single item lot sizing problem where a minimum order quantity restriction, instead of the setup cost, guarantees a certain level of production lots. A detailed analysis of the model and an investigation of the particularities of the cumulative demand structure allowed us to develop a solution algorithm based on the concept of minimal ...
متن کاملAn Inexact-Fuzzy-Stochastic Optimization Model for a Closed Loop Supply Chain Network Design Problem
The development of optimization and mathematical models for closed loop supply chain (CLSC) design has attracted considerable interest over the past decades. However, the uncertainties that are inherent in the network design and the complex interactions among various uncertain parameters are challenging the capabilities of the developed tools. The aim of this paper, therefore, is to propose a n...
متن کاملA comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand
In the coordinated lot-size problem, a major setup cost is incurred when at least one member of a product family is produced and a minor setup cost for each different item produced. This research consolidates the various modeling and algorithmic approaches reported in the literature for the coordinated replenishment problem with deterministic dynamic demand. For the two most effective approache...
متن کاملApproximating the solution of a dynamic , stochastic multiple knapsack problem
We model an environment where orders arrive probabilistically over time, with their revenues and capacity requirements becoming known upon arrival. The decision is whether to accept an order, receiving a reward and reserving capacity, or reject an order, freeing capacity for possible future arrivals. We model the dynamic, stochastic multiple knapsack problem (DSMKP) with stochastic dynamic prog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1985
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.33.3.684